Representing Boolean formulas by using trees of implicants and implicates
نویسندگان
چکیده
A new tree-based representation for propositional formulas is introduced. This representation, the ∆-trees, allows a compact representation for well-formed formulas as well as a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of
منابع مشابه
Anti-Links for Boolean Function Manipulation
Manipulation of Boolean functions has important applications in such fields as hardware verification, non-monotonic reasoning, and decision support. Most often, in such applications, the set of prime implicates/implicants of a large formula must be computed. Many algorithms have been proposed to compute the prime implicates of propositionalBoolean formulas, e.g. [4, 5]. Most of them assume that...
متن کاملImplicant based parallel all solution solver for Boolean satisfiability
This paper develops a parallel computational solver for computing all satifying assignments of a Boolean system of equations defined by Boolean functions of several variables. While there are we known solvers for satisfiability of Boolean formulas in CNF form, these are designed primarily for deciding satisfiability of the formula and do not address the problem of finding all satisfying solutio...
متن کاملMETAPRIME, an Interactive Fault Tree Analyser
The performances of almost all available fault tree analysis tools are limited by the performance of the prime implicant computation procedure they use. All these procedures manipulate the prime implicants of the fault trees in extension, so that the analysis costs are directly related to the number of prime implicants to be generated, which in practice makes these tools di cult to be applied o...
متن کاملAdvanced Features of the Fault Tree Solver FTREX
This paper presents advanced features of a fault tree solver FTREX (Fault Tree Reliability Evaluation eXpert). Fault tree analysis is one of the most commonly used methods for the safety analysis of industrial systems especially for the probabilistic safety analysis (PSA) of nuclear power plants. Fault trees are solved by the classical Boolean algebra[1,2], conventional Binary Decision Diagram ...
متن کاملPrime Compilation of Non-Clausal Formulae
Formula compilation by generation of prime implicates or implicants finds a wide range of applications in AI. Recent work on formula compilation by prime implicate/implicant generation often assumes a Conjunctive/Disjunctive Normal Form (CNF/DNF) representation. However, in many settings propositional formulae are naturally expressed in non-clausal form. Despite a large body of work on compilat...
متن کامل